Cyclic transfers in school timetabling

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolutionary Algorithm for School Timetabling

In this paper we describe a method for generating high school timetables using an Evolutionary Algorithm (E.A.) with a new set of genetic operators inspired on the Infected Genes Evolutionary Algorithm (Tavares, 99). We show that widening region of infection considered in (Fernandes, 99) leads to a very significant increase in the performance of the E.A.. Comparative tests between the E.A. with...

متن کامل

Basic Models for School Timetabling

In this paper, we propose and investigate basic models for school timetabling that are obtained by decomposing a given problem into non-preemptive, single-machine scheduling problems and a two-dimensional geometric placement problem. Furthermore, we introduce and exploit tracks. A track is of a set of rails, where each rail is a set of tasks. The problem of solving a track consists in finding a...

متن کامل

Metaheuristics for High School Timetabling

In this paper we present the results of an investigation of the possibilities offered by three wellknown metaheuristic algorithms to solve the timetable problem, a multi-constrained, NP-hard, combinatorial optimization problem with real-world applications. First, we present our model of the problem, including the definition of a hierarchical structure for the objective function, and of the neig...

متن کامل

The Theory of Cyclic Transfers

This paper develops the theory of cyclic transfers, a neighborhood search strategy for a broad class of combinatorial problems. The problem class is characterized by a two-phase decision process: first, the optimal assignment of elements to clusters and, second, the optimal configuration of the elements within each cluster. Many important and difficult problems fall into this problem class, for...

متن کامل

Resource assignment in high school timetabling

This paper explores one aspect of the high school timetabling problem, namely the assignment of resources, such as teachers and rooms, to meetings after times are assigned. Several algorithms, with run times of just a few seconds, are presented and tested on real-world data. The best of these is currently in operation within KTS, a free, public web site for high school timetabling created by th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: OR Spectrum

سال: 2010

ISSN: 0171-6468,1436-6304

DOI: 10.1007/s00291-010-0227-y